Linear dimensionality reduction in random motion planning
نویسندگان
چکیده
منابع مشابه
Linear dimensionality reduction in random motion planning
The paper presents a method to control random sampling in motion planning algorithms. The principle of the method is to use on line the results of a probabilistic planner to describe the free space in which the planning takes place, by computing a Principal Component Analysis (PCA). This method identifies the locally free directions of the free space. Given that description, our algorithm accel...
متن کاملRandom walk-based fuzzy linear discriminant analysis for dimensionality reduction
Dealing with high-dimensional data has always been a major problem with the research of pattern recognition and machine learning, and linear discriminant analysis (LDA) is one of the most popular methods for dimensionality reduction. However, it suffers from the problem of being too sensitive to outliers. Hence to solve this problem, fuzzy membership can be introduced to enhance the performance...
متن کاملLinear Discriminant Dimensionality Reduction
Fisher criterion has achieved great success in dimensionality reduction. Two representative methods based on Fisher criterion are Fisher Score and Linear Discriminant Analysis (LDA). The former is developed for feature selection while the latter is designed for subspace learning. In the past decade, these two approaches are often studied independently. In this paper, based on the observation th...
متن کاملNon-Linear Dimensionality Reduction
A method for creating a non–linear encoder–decoder for multidimensional data with compact representations is presented. The commonly used technique of autoassociation is extended to allow non–linear representations, and an objective function which penalizes activations of individual hidden units is shown to result in minimum dimensional encodings with respect to allowable error in reconstruction.
متن کاملLinear Dependent Dimensionality Reduction
We formulate linear dimensionality reduction as a semi-parametric estimation problem, enabling us to study its asymptotic behavior. We generalize the problem beyond additive Gaussian noise to (unknown) nonGaussian additive noise, and to unbiased non-additive models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Robotics Research
سال: 2011
ISSN: 0278-3649,1741-3176
DOI: 10.1177/0278364911403335